A non-enumerable well-ordered set
نویسندگان
چکیده
منابع مشابه
A rigorous procedure for generating a well-ordered Set of Reals without use of Axiom of Choice / Well-Ordering Theorem
Well-ordering of the Reals presents a major challenge in Set theory. Under the standard Zermelo Fraenkel Set theory (ZF) with the Axiom of Choice (ZFC), a well-ordering of the Reals is indeed possible. However the Axiom of Choice (AC) had to be introduced to the original ZF theory which is then shown equivalent to the well-ordering theorem. Despite the result however, no way has still been foun...
متن کاملSampling of Multiple Variables Based on Partially Ordered Set Theory
We introduce a new method for ranked set sampling with multiple criteria. The method relaxes the restriction of selecting just one individual variable from each ranked set. Under the new method for ranking, units are ranked in sets based on linear extensions in partially order set theory with considering all variables simultaneously. Results willbe evaluated by a relatively extensive simulation...
متن کاملProjectively Well-Ordered Inner Models
We show that the reals in the minimal iterable inner model having n Woodin cardinals are precisely those which are A,‘+ 2 definable from some countable ordinal. (One direction here is due to Hugh Woodin.) It follows that this model satisfies “There is a A.‘+2 well-order of the reals”. We also describe some other connections between the descriptive set theory of projective sets and inner models ...
متن کاملPartitions of a Finite Partially Ordered Set
In this paper, we investigate the notion of partition of a finite partially ordered set (poset, for short). We will define three different notions of partition of a poset, namely, monotone, regular, and open partition. For each of these notions we will find three equivalent definitions, that will be shown to be equivalent. We start by defining partitions of a poset in terms of fibres of some su...
متن کاملRecursively enumerable sets and well-ordering of their enumerations
Considering sets of natural numbers from the computational point of view we distinguish as the main class of sets the collection of recursively enumerable sets. However, inside this class we can see the crucial difference which lies between recursive and non-recursive sets. In this paper we use ordinal numbers to indicate recursiveness of sets. We do not employ ordinals in the way which was use...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the American Mathematical Society
سال: 1914
ISSN: 0002-9904
DOI: 10.1090/s0002-9904-1914-02509-1